Combinatorics of Finite Geometries

نویسنده

  • P. McMULLEN
چکیده

85 admirably clear. While the book is devoted to a single problem, the techniques employed would seem to have wider utility, and so should appeal to those interested in efficiency of algorithms in graph theory, and further (perhaps) to those wishing to apply such ideas to the real world. I enjoyed reading this book. It is written in a way which should appeal to advanced undergraduate and postgraduate students who wish to learn something of the synthetic approach to finite geometry as well as to practising mathematicians with interests in other branches of the subject. The subject is developed in a most easily followed style beginning with Near Linear Spaces and Linear Spaces; both are then given an axiomatic treatment in the first two chapters. The concept of projective plane is developed in Chapter 3. This includes a discussion of the interrelationship between Desargues' theorem and the study of collineations. After the introduction of coordinates there is work on Pappus' theorem and then the chapter includes a section on projective spaces of dimension greater than two. It concludes with proving that Desargues' theorem holds in any projective plane embedded in a projective w-space, with n ^ 3. In Chapter 4 Affine spaces are considered. Firstly there is a discussion of affine planes, their relationship with projective planes and some particular results concerning collineations in them. The idea of affine spaces is then introduced. Once these various spaces have been introduced, along with some knowledge of their structure, it is possible to discuss geometrical objects contained within them. For a detailed description of the algebraic geometry of Galois spaces one should refer to the comprehensive text by Hirschfeld [2]. In Chapter 5 of Professor Batten's book the ideas of polar spaces are developed axiomatically. The connection with the polarity with respect to a quadric follows, together with linear subspaces of a polar system. The discussion includes a note of the usual results due to Primrose [3] concerning the numbers of subspaces on elliptic and hyperbolic quadrics in Galois spaces. This chapter concludes with a short history of the ideas of polar spaces, stating various results due to Tits [4] and Buekenhout and Shult [1]. The next chapter is devoted to generalized quadrangles. Some basic results concerning the relationships between the parameters are first proved, then the seven known classes of these structures are described. A number of further results concerning these …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applications of finite geometries to information security

Many problems in information security can be resolved using combinatorial structures, primarily geometries. In fact, often the most efficient solutions kn'awn are provided by schemes based on geometries. In this expository article we look at two problems in information security and discuss proposed geometrical solutions. In addition, we generalise two known constructions for Key Distribution Pa...

متن کامل

Maximal t-Critical Linear Hypergraphs

A construction using finite affine geometries is given to show that the maximum number of edges in a τ -critical linear hypergraph is (1−o(1))τ2. This asymptotically answers a question of Roudneff [14], Aharoni and Ziv [1]. 1 This copy was printed on November 16, 2001. Submitted to Graphs and Combinatorics

متن کامل

Partitioning Segre varieties and projective spaces

The recent interest both in partitions of finite geometries into other geometric objects and in the classical Segre varieties over finite fields are the background motivation for this paper. More precisely, partitions of Segre varieties into Segre varieties are investigated and the idea of nested partitions is introduced. Other partitions, namely of projective spaces and hyperbolic quadrics, ar...

متن کامل

PRIN 2012 “ Geometric Structures , Combinatorics and their Applications ” Principal Investigator : Guglielmo Lunardon 1 Short

The main objective of this Project is to develop and promote basic research in the framework of Incidence Geometries, Galois Geometries and Combinatorics, both through active investigation performed by the involved researchers on subjects of great up-to-date scientific interest and through the organisation of national and international Conferences, Workshops and specialised Schools. Further, sp...

متن کامل

Further Problems concerning Finite Geometries and Finite Groups

This note is intended as a very long footnote to the other finite geometry papers in this volume. Areas of overlap between finite geometry (or combinatorics) and finite groups will be listed which were either not mentioned, or were only briefly alluded to, at the conference. However, the descriptions and bibliography given here will also be brief: the goal is to indicate research directions, no...

متن کامل

Coding Theory and Algebraic Combinatorics

This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings, kissing numbers, lattices, and association schemes. In particular, special interest is devoted to the relationship between codes and combinatorial designs. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006